Combinatorial Codes 94 B 25

Combinatorial Codes 94

A new lower bound for snake-in-the-box codes

In this paper we give a new lower bound on the length of Snake-in-the-Box Codes, i.e., induced cycles in the d-dimensional cube. The bound is a linear function of the number of vertices of the cube and improves the bound c · 2/d, where c is a constant, proved by Danzer and Klee. AMS subject classification 1980: 05 C 35, 94 B 25

Computational methods in codes and games

Aalto University, P.O. Box 11000, FI-00076 Aalto www.aalto.fi Author Esa A. Seuranen Name of the doctoral dissertation Computational Methods in Codes and Games Publisher School of Electrical Engineering Unit Department of Communications and Networking Series Aalto University publication series DOCTORAL DISSERTATIONS 119/2011 Field of research Information Theory Manuscript submitted 30 May 2011 ...

Synchronization and decomposability for a family of codes: Part 2

This paper is the second part of a work dealing with two Schiitzenberger's conjectures on variable-length codes. It contains the detailed proofs of the characterization that we obtained for the degree and the decomposability of finite maximal codes over the alphabet {a, b} with at most 3 occurrences of the letter b in each word.

Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families

This paper provides a mathematical analysis of optimal algebraic manipulation detection (AMD) codes. We prove several lower bounds on the success probability of an adversary and we then give some combinatorial characterizations of AMD codes that meet the bounds with equality. These characterizations involve various types of generalized difference families. Constructing these difference families...